<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/graph_algorithms/basic_graph/graph_representation/graph_edge/edge.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('edge_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">edge.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="edge_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef GRAPHEDGE</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define GRAPHEDGE</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&lt;tuple&gt;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&lt;memory&gt;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;{</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    <span class="keyword">namespace </span>GraphAlgorithm</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    {</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;</div>
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">   39</a></span>&#160;        <span class="keyword">template</span>&lt;<span class="keyword">typename</span> VType&gt; <span class="keyword">struct </span><a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">Edge</a></div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        {</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keyword">public</span>:</div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a92b817240405b82f23dee4cdbefcb54f">   42</a></span>&#160;            <span class="keyword">typedef</span> <span class="keywordtype">int</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a92b817240405b82f23dee4cdbefcb54f">VIDType</a>;     </div>
<div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">   43</a></span>&#160;            <span class="keyword">typedef</span> <span class="keywordtype">int</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">EWeightType</a>; </div>
<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">   44</a></span>&#160;            <span class="keyword">typedef</span> VType <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a>; </div>
<div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a6cc12c05f7645ce74a6cff13b9ea932c">   45</a></span>&#160;            <span class="keyword">typedef</span> std::tuple&lt;VIDType,VIDType,EWeightType&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a6cc12c05f7645ce74a6cff13b9ea932c">EdgeTupleType</a>; </div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;</div>
<div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#adf42723a706c3ff53b1d1bb612dfe03b">   52</a></span>&#160;            <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#adf42723a706c3ff53b1d1bb612dfe03b">Edge</a>(std::shared_ptr&lt;VertexType&gt;v1,std::shared_ptr&lt;VertexType&gt;v2,EWeightType w):</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;                <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a634535a3f12be42c3c6ffb6d3c604fb7">vertex1</a>(v1),<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a762ca9f6ad5abb1adf8b7e1319ea3b52">vertex2</a>(v2),<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a139b40cb4524df195804bdce7a117164">weight</a>(w)</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;            {</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;                assert(<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a634535a3f12be42c3c6ffb6d3c604fb7">vertex1</a>&amp;&amp;<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a762ca9f6ad5abb1adf8b7e1319ea3b52">vertex2</a>);</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;            }</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div>
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a9f7ecd0678638168991435c8370c8dae">   62</a></span>&#160;            <span class="keyword">virtual</span> std::string  <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a9f7ecd0678638168991435c8370c8dae">to_string</a>()<span class="keyword">const</span></div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="keyword">            </span>{</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                std::ostringstream os;</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                os&lt;&lt;<span class="stringliteral">&quot;edge weight:&quot;</span>&lt;&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a139b40cb4524df195804bdce7a117164">weight</a>&lt;&lt;<span class="stringliteral">&quot;\t vertex[id1:&quot;</span>&lt;&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a634535a3f12be42c3c6ffb6d3c604fb7">vertex1</a>-&gt;id&lt;&lt;<span class="stringliteral">&quot;,id2:&quot;</span>&lt;&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a762ca9f6ad5abb1adf8b7e1319ea3b52">vertex2</a>-&gt;id&lt;&lt;<span class="stringliteral">&quot;]&quot;</span>;</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;                <span class="keywordflow">return</span> os.str();</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;            }</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;</div>
<div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a1068057fa7240467e079d66a1a5edd7a">   72</a></span>&#160;            <span class="keyword">const</span> EdgeTupleType <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a1068057fa7240467e079d66a1a5edd7a">edge_tuple</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="keyword">            </span>{</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                <span class="keywordflow">return</span> std::make_tuple(<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a634535a3f12be42c3c6ffb6d3c604fb7">vertex1</a>-&gt;id,<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a762ca9f6ad5abb1adf8b7e1319ea3b52">vertex2</a>-&gt;id,<a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a139b40cb4524df195804bdce7a117164">weight</a>);</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            }</div>
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a634535a3f12be42c3c6ffb6d3c604fb7">   76</a></span>&#160;            std::shared_ptr&lt;VertexType&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a634535a3f12be42c3c6ffb6d3c604fb7">vertex1</a>;   </div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a762ca9f6ad5abb1adf8b7e1319ea3b52">   77</a></span>&#160;            std::shared_ptr&lt;VertexType&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a762ca9f6ad5abb1adf8b7e1319ea3b52">vertex2</a>;   </div>
<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a139b40cb4524df195804bdce7a117164">   78</a></span>&#160;            EWeightType <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a139b40cb4524df195804bdce7a117164">weight</a>;                    </div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        };</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;    }</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;}</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;<span class="preprocessor">#endif // GRAPHEDGE</span></div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;</div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_a6cc12c05f7645ce74a6cff13b9ea932c"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a6cc12c05f7645ce74a6cff13b9ea932c">IntroductionToAlgorithm::GraphAlgorithm::Edge::EdgeTupleType</a></div><div class="ttdeci">std::tuple&lt; VIDType, VIDType, EWeightType &gt; EdgeTupleType</div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00045">edge.h:45</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_a95cf631669c2a0d1bebb58ba2af110de"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">IntroductionToAlgorithm::GraphAlgorithm::Edge::EWeightType</a></div><div class="ttdeci">int EWeightType</div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00043">edge.h:43</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_a9f7ecd0678638168991435c8370c8dae"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a9f7ecd0678638168991435c8370c8dae">IntroductionToAlgorithm::GraphAlgorithm::Edge::to_string</a></div><div class="ttdeci">virtual std::string to_string() const </div><div class="ttdoc">to_string：返回边的字符串描述 </div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00062">edge.h:62</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a></div><div class="ttdoc">Edge：图的边，算法导论22章22.1节 </div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00039">edge.h:39</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_a92b817240405b82f23dee4cdbefcb54f"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a92b817240405b82f23dee4cdbefcb54f">IntroductionToAlgorithm::GraphAlgorithm::Edge::VIDType</a></div><div class="ttdeci">int VIDType</div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00042">edge.h:42</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_a634535a3f12be42c3c6ffb6d3c604fb7"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a634535a3f12be42c3c6ffb6d3c604fb7">IntroductionToAlgorithm::GraphAlgorithm::Edge::vertex1</a></div><div class="ttdeci">std::shared_ptr&lt; VertexType &gt; vertex1</div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00076">edge.h:76</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_a2a7bb332de66131ed664eb279c7ac1ed"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">IntroductionToAlgorithm::GraphAlgorithm::Edge::VertexType</a></div><div class="ttdeci">VType VertexType</div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00044">edge.h:44</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_a139b40cb4524df195804bdce7a117164"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a139b40cb4524df195804bdce7a117164">IntroductionToAlgorithm::GraphAlgorithm::Edge::weight</a></div><div class="ttdeci">EWeightType weight</div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00078">edge.h:78</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_a1068057fa7240467e079d66a1a5edd7a"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a1068057fa7240467e079d66a1a5edd7a">IntroductionToAlgorithm::GraphAlgorithm::Edge::edge_tuple</a></div><div class="ttdeci">const EdgeTupleType edge_tuple() const </div><div class="ttdoc">edge_tuple：获取边的三元素元组 </div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00072">edge.h:72</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_html"><div class="ttname"><a href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></div><div class="ttdoc">Namespace of IntrodunctionToAlgorithm. </div><div class="ttdef"><b>Definition:</b> <a href="longest__common__subsequence_8h_source.html#l00024">longest_common_subsequence.h:24</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_adf42723a706c3ff53b1d1bb612dfe03b"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#adf42723a706c3ff53b1d1bb612dfe03b">IntroductionToAlgorithm::GraphAlgorithm::Edge::Edge</a></div><div class="ttdeci">Edge(std::shared_ptr&lt; VertexType &gt;v1, std::shared_ptr&lt; VertexType &gt;v2, EWeightType w)</div><div class="ttdoc">显式构造函数，必须指定两个顶点和一个权重 </div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00052">edge.h:52</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge_html_a762ca9f6ad5abb1adf8b7e1319ea3b52"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a762ca9f6ad5abb1adf8b7e1319ea3b52">IntroductionToAlgorithm::GraphAlgorithm::Edge::vertex2</a></div><div class="ttdeci">std::shared_ptr&lt; VertexType &gt; vertex2</div><div class="ttdef"><b>Definition:</b> <a href="edge_8h_source.html#l00077">edge.h:77</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_aa0a5ddea82682e3e6fbdbaa3337ee0e.html">graph_algorithms</a></li><li class="navelem"><a class="el" href="dir_7ed7dee3af3b488a5e053ec9bcb71f0e.html">basic_graph</a></li><li class="navelem"><a class="el" href="dir_d12496f1fc7378ee9aea361c57814de0.html">graph_representation</a></li><li class="navelem"><a class="el" href="dir_b83358a15c32f6de97899a151d3c9752.html">graph_edge</a></li><li class="navelem"><a class="el" href="edge_8h.html">edge.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
